Stereo Correspondence with Occlusions using Graph Cuts
نویسندگان
چکیده
Given two stereo images of a scene, it is possible to recover a 3D understanding of the scene. This is the primary way that the human visual system estimates depth. This process is useful in applications like robotics, where depth sensors may be expensive but a pair of cameras is relatively cheap. In order to construct depth maps from stereo images, we need to first solve the stereo correspondence problem. The stereo correspondence problem has traditionally been one of the most studied topics in image processing and computer vision[1] but it is still an area of active research.
منابع مشابه
Computing Visual Correspondence with Occlusions using Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [7, 14, 17] have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present a new metho...
متن کاملComputing Visual Correspondence with Occlusions via Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present two new met...
متن کاملReducing Search Space for Stereo Correspondence with Graph Cuts
In recent years, stereo correspondence algorithms based on graph cuts have gained popularity due to the significant improvement in accuracy over the local methods. Even though there has been a noticeable progress in efficient max-flow algorithms, the computational cost for graph cut stereo is still quite heavy, especially if the disparity search range is large. In this paper, we investigate and...
متن کاملGraph Cut Algorithms for Binocular Stereo with Occlusions
Most binocular stereo algorithms assume that all scene elements are visible from both cameras. Scene elements that are visible from only one camera, known as occlusions, pose an important challenge for stereo. Occlusions are important for segmentation, because they appear near discontinuities. However, stereo algorithms tend to ignore occlusions because of their difficulty. One reason is that o...
متن کاملGraph-Cut and Belief-Propagation Stereo on Real-World Image Sequences
This paper deals with stereo correspondence search, using graph cuts and belief propagation, for estimating depth maps. The results following different preprocessing steps are evaluated, using the quality of the disparity map. Running times are also investigated. For evaluation purposes, different kinds of images have been used: reference images from the Middlebury Stereo website, synthetic dri...
متن کامل